Breaks, cuts, and patterns

Breaks, cuts, and patterns

We generalize the concept of a break by considering pairs of arbitrary rounds. We show that a set of home-away patterns minimizing the number of generalized breaks cannot be found in polynomial time, unless P=NP. When all teams have the same break set, the decision version becomes easy; optimizing remains NP-hard.

Minimizing breaks by maximizing cuts

We propose to solve the break minimization problem in sports scheduling by transforming it into a maximum cut problem in an undirected graph and applying a branch-and-cut algorithm. Our approach outperforms previous approaches with constraint programming and integer programming techniques.

Type Two Cuts, Bad Cuts and Very Bad Cuts

Type two cuts, bad cuts and very bad cuts are introduced in [KL] for studying the relationship between Loeb measure and U-topology of a hyper nite time line in an !1-saturated nonstandard universe. The questions concerning the existence of those cuts are asked there. In this paper we answer, fully or partially, some of those questions by showing that: (1) type-two cuts exist, (2) the @1-isomorp...

patterns and variations in native and non-native interlanguage pragmatic rating: effects of rater training, intercultural proficiency, and self-assessment

although there are studies on pragmatic assessment, to date, literature has been almost silent about native and non-native english raters’ criteria for the assessment of efl learners’ pragmatic performance. focusing on this topic, this study pursued four purposes. the first one was to find criteria for rating the speech acts of apology and refusal in l2 by native and non-native english teachers...

About Folding-Unfolding Cuts and Cuts Modulo